全文获取类型
收费全文 | 921篇 |
免费 | 267篇 |
国内免费 | 50篇 |
出版年
2024年 | 4篇 |
2023年 | 8篇 |
2022年 | 13篇 |
2021年 | 15篇 |
2020年 | 42篇 |
2019年 | 26篇 |
2018年 | 18篇 |
2017年 | 54篇 |
2016年 | 61篇 |
2015年 | 48篇 |
2014年 | 77篇 |
2013年 | 60篇 |
2012年 | 67篇 |
2011年 | 53篇 |
2010年 | 53篇 |
2009年 | 72篇 |
2008年 | 56篇 |
2007年 | 53篇 |
2006年 | 66篇 |
2005年 | 58篇 |
2004年 | 58篇 |
2003年 | 32篇 |
2002年 | 26篇 |
2001年 | 26篇 |
2000年 | 29篇 |
1999年 | 26篇 |
1998年 | 20篇 |
1997年 | 24篇 |
1996年 | 18篇 |
1995年 | 8篇 |
1994年 | 12篇 |
1993年 | 21篇 |
1992年 | 12篇 |
1991年 | 10篇 |
1990年 | 8篇 |
1989年 | 3篇 |
1975年 | 1篇 |
排序方式: 共有1238条查询结果,搜索用时 187 毫秒
101.
We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
102.
103.
104.
为高精度模拟高动态条件下GNSS信号的多普勒特性,提出一种任意阶直接数字合成信号合成器的设计方法。设计任意阶直接数字合成信号合成器的结构;通过理论分析,推导各级累加器相位初值的计算公式;给出字长选择方法。经仿真验证,该方法能精确模拟GNSS信号的多普勒特性。此外,提出的直接数字合成器设计方法不受阶数的限制,可普遍应用于各类信号模拟器的设计。 相似文献
105.
Martijn van Ee 《海军后勤学研究》2020,67(2):147-158
We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability pi: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete. 相似文献
106.
We consider the problem of nonparametric multi-product dynamic pricing with unknown demand and show that the problem may be formulated as an online model-free stochastic program, which can be solved by the classical Kiefer-Wolfowitz stochastic approximation (KWSA) algorithm. We prove that the expected cumulative regret of the KWSA algorithm is bounded above by where κ1, κ2 are positive constants and T is the number of periods for any T = 1, 2, … . Therefore, the regret of the KWSA algorithm grows in the order of , which achieves the lower bounds known for parametric dynamic pricing problems and shows that the nonparametric problems are not necessarily more difficult to solve than the parametric ones. Numerical experiments further demonstrate the effectiveness and efficiency of our proposed KW pricing policy by comparing with some pricing policies in the literature. 相似文献
107.
108.
109.
分形理论在装备保障组织设计中的应用研究 总被引:1,自引:0,他引:1
基于分形理论,提出了一种适应敏捷化要求的分形装备保障系统组织模型,能够通过快速的重构以响应战场环境的变化。阐明了其层次性、自相似、自组织和自优化的组织结构特点,分析了其运行模式。 相似文献
110.